Hashing into Generalized Huff Curves

نویسندگان

  • Xiaoyang He
  • Wei Yu
  • Kunpeng Wang
چکیده

Huff curves are well known for efficient arithmetics to their group law. In this paper, we propose two deterministic encodings from Fq to generalized Huff curves. When q ≡ 3 (mod 4), the first deterministic encoding based on Skalpa’s equality saves three field squarings and five multiplications compared with birational equivalence composed with Ulas’ encoding. It costs three multiplications less than simplified Ulas map. When q ≡ 2 (mod 3), the second deterministic encoding based on calculating cube root costs one field inversion less than Yu’s encoding at the price of three field multiplications and one field squaring. It costs one field inversion less than Alasha’s encoding at the price of one multiplication. We estimate the density of images of these encodings with Chebotarev density theorem. Moreover, based on our deterministic encodings, we construct two hash functions from messages to generalized Huff curves indifferentiable from a random oracle.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a new generalization of Huff curves

Recently two kinds of Huff curves were introduced as elliptic curves models and their arithmetic was studied. It was also shown that they are suitable for cryptographic use such as Montgomery curves or Koblitz curves (in Weierstrass form) and Edwards curves. In this work, we introduce the new generalized Huff curves ax(y − c) = by(x−d) with abcd(ac−bd) 6= 0, which contains the generalized Huff’...

متن کامل

Pairings on Generalized Huff Curves

This paper presents the Tate pairing computation on generalized Huff curves proposed by Wu and Feng in [22]. In fact, we extend the results of the Tate pairing computation on the standard Huff elliptic curves done previously by Joye, Tibouchi and Vergnaud in [14]. We show that the addition step of the Miller loop can be performed in 1M+(k+15)m+2c and the doubling one in 1M+1S+(k+12)m+5s+2c on t...

متن کامل

Analysis of Recorded Rainfall Information for the Purpose of Huff Curves Extraction in the Dez Dam

Identifying the rainfall characteristics and understanding the rainfall-related processes is one of the key factors in the scientific management of water resources. Selection of the design storm is the first step in the estimation of the design flood. Determining temporal rainfall patterns is very important as one of the design rainfall properties in flood estimation and the design of drainage ...

متن کامل

Compressed Image Hashing using Minimum Magnitude CSLBP

Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...

متن کامل

Arithmetic progressions on Huff curves

We look at arithmetic progressions on elliptic curves known as Huff curves. By an arithmetic progression on an elliptic curve, we mean that either the x or y-coordinates of a sequence of rational points on the curve form an arithmetic progression. Previous work has found arithmetic progressions on Weierstrass curves, quartic curves, Edwards curves, and genus 2 curves. We find an infinite number...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015